#include "trap.h"

#define N 40

int fib[N] = {1, 1};
int ans[] = {1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155};

int main() {
	int i;
	for(i = 2; i < N; i ++) {
		fib[i] = fib[i - 1] + fib[i - 2];
		nemu_assert(fib[i] == ans[i]);
	}

	nemu_assert(i == N);

	return 0;
}
